Fair Bandwidth Allocation for Responsive and Unresponsive Flows Using a Capture-Recapture Model
نویسندگان
چکیده
Absfrac-In this paper, we propose a novel technique called CARE (CApture-REcapture fair sharing) to provide fair bandwidth sharing. CARE estimates two network resource parameters: the number of Bows in the buffer and the data source rate of a Bow by using a capiure-recapiure model. The capture-recapture model depends on simply the random captnringlrecapturing of the incoming packets, and as a result, it provides a good approrimation tool with low timelspace complexity. Our experiments and analysis will demonstrate that CARE provides highly accnrate fair bandwidth share under dinerent network con6gnrationa and outperforms the existing mechanisms.
منابع مشابه
A queue management algorithm for fair bandwidth allocation
In this thesis, a stateless active queue management algorithm called “PUNSI” which aims to achieve fair bandwidth allocation in congested routers is proposed. This algorithm prevents unresponsive flows from dominating available bandwidth shared with responsive flows by penalizing packets from unresponsive flows hopefully with a higher probability than those from responsive flows. It is motivate...
متن کاملA Fair Traffic Conditioner for the Assured Service in a Differentiated Services Internet
A research issue under investigation in the context of differentiated services (DiffServ) is the fair distribution of bandwidth between aggregates sharing the same Assured Forwarding (AF) class. Multiplexing both responsive and unresponsive flows, e.g. TCP and UDP respectively, leads to unfair sharing of the available bandwidth in over-provisioned networks. To date, much effort has concentrated...
متن کاملAn active queue management scheme based on a capture-recapture model
One of the challenges in the design of switches/routers is the efficient and fair use of the shared bottleneck bandwidth among different Internet flows. In particular, to provide fair bandwidth sharing, different buffer management schemes are developed to protect the well-behaved flows from the misbehaving flows. However, most of the existing buffer management schemes cannot provide accurate fa...
متن کاملA new bandwidth sharing scheme for non-responsive multicast flows
In this work, we propose a new active queue management mechanism called MFQ (Multicast Fair Queuing) for multicast flows. MFQ is independent of the inter-multicast fairness policy and it interacts with a multicast bandwidth allocation module that can implement either a multicast fairness policy or a multicast pricing model and tries using a single FIFO queue to achieve the expected allocation w...
متن کاملA stateless active queue management scheme for approximating fair bandwidth allocation
We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By doin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004